Energy-preserving methods on Riemannian manifolds
نویسندگان
چکیده
منابع مشابه
A Geometry Preserving Kernel over Riemannian Manifolds
Abstract- Kernel trick and projection to tangent spaces are two choices for linearizing the data points lying on Riemannian manifolds. These approaches are used to provide the prerequisites for applying standard machine learning methods on Riemannian manifolds. Classical kernels implicitly project data to high dimensional feature space without considering the intrinsic geometry of data points. ...
متن کاملTrust-Region Methods on Riemannian Manifolds
A general scheme for trust-region methods on Riemannian manifolds is proposed and analyzed. Among the various approaches available to (approximately) solve the trust-region subproblems, particular attention is paid to the truncated conjugate-gradient technique. The method is illustrated on problems from numerical linear algebra.
متن کاملSeparability preserving Dirac reductions of Poisson pencils on Riemannian manifolds
Dirac deformation of Poisson operators of arbitrary rank is considered. The question when Dirac reduction does not destroy linear Poisson pencils is studied. A class of separability preserving Dirac reductions in the corresponding quasi-bi-Hamiltonian systems of Benenti type is discussed. Two examples of such reductions are given. This paper will appear in J. Phys. A: Math. Gen. AMS 2000 Subjec...
متن کاملFlowers on Riemannian manifolds
In this paper we will present two upper bounds for the length of a smallest “flower-shaped” geodesic net in terms of the volume and the diameter of a manifold. Minimal geodesic nets are critical points of the length functional on the space of graphs immersed into a Riemannian manifold. Let Mn be a closed Riemannian manifold of dimension n. We prove that there exists a minimal geodesic net that ...
متن کاملFitting Curves on Riemannian Manifolds Using Energy Minimization
Given data points p0, . . . , pN on a Riemannian manifold M and time instants 0 = t0 < t1 < . . . < tN = 1, we consider the problem of finding the curve γ on M that best approximates the data points at the given instants. In this work, γ is expressed as the curve that minimizes the weighted sum of a least-squares term penalizing the lack of fitting to the data points and a regularity term defin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 2019
ISSN: 0025-5718,1088-6842
DOI: 10.1090/mcom/3470